Bounds for Energy-Efficient Survivable IP Over WDM Networks With Network Coding

نویسندگان

  • Mohamed Musa
  • Taisir Elgorashi
  • Jaafar Elmirghani
چکیده

In this work we establish analytic bounds for the energy efficiency of the 1+1 survivable IP over WDM networks using network coding. The analytic bounds are shown to be in close agreement with our previously reported results. They provide verification of the MILP and heuristics proposed previously and an efficient, compact means of evaluating the network results, and allow the performance of large networks to be determined easily.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Survivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm

In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm w...

متن کامل

Survivable IP Over WDM: Guaranteeing Minimum Network Bandwidth

A novel survivable IP over WDM network design problem is proposed. The IP network uses lightpath services of the WDM network to implement its IP links. The WDM network can provide unprotected and protected lightpaths, as well as a new lightpath service referred to as survivable pair. The IP network must support two traffic matrices, one under normal conditions and the other whenever there is a ...

متن کامل

Survivable Routing in IP-over-WDM Networks in the Presence of Multiple Failures

Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. As finding a survivable mapping is known to be NP-complete, in practice it requires a heuristic approach. We have introduced in [1] a novel algorithm called “SMART”, th...

متن کامل

A heuristic algorithm for survivable mapping in IP-over-WDM networks

Survivability is an important issue in IP-over-WDM networks. IP layer failure recovery is possible only if the IP topology is mapped onto the WDM topology in a survivable way, i.e., the failure of any single fiber will not disconnect the IP topology. This problem has been proven NP-hard in [1]. And an integer linear programming (ILP) formulation that solves this problem is provided in [2]. We p...

متن کامل

Optimal Coding Subgraph Selection under Survivability Constraint

Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018